-
1 algorithmically unsolvable
English-Russian scientific dictionary > algorithmically unsolvable
-
2 algorithmically unsolvable problem
Математика: алгоритмически неразрешимая проблемаУниверсальный англо-русский словарь > algorithmically unsolvable problem
-
3 algorithmically unsolvable problem
English-Russian scientific dictionary > algorithmically unsolvable problem
-
4 unsolvable
-
5 algorithmically
алгоритмически algorithmically unsolvable problem ≈ алгоритмически неразрешимая проблемаАлгоритмическиБольшой англо-русский и русско-английский словарь > algorithmically
-
6 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem
См. также в других словарях:
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Quasicrystal — Atomic model of an aluminum palladium manganese (Al Pd Mn) quasicrystal surface. Similar to Fig. 6 in Ref.[1] A quasiperiodic crystal, or, in short, quasicrystal, is a structure that is ordered but not periodic. A quasicrystalline pattern can… … Wikipedia
Nonlinear resonance — In physics, nonlinear resonance is the occurrence of resonance in a nonlinear system. In nonlinear resonance the system behaviour – resonance frequencies and modes – depends on the amplitude of the oscillations, while for linear systems this is… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
Entscheidungsproblem — In mathematics, the Entscheidungsproblem (pronounced [ɛntˈʃaɪdʊŋspʁoˌbleːm], German for decision problem ) is a challenge posed by David Hilbert in 1928. The Entscheidungsproblem asks for an algorithm that will take as input a description of a… … Wikipedia
Hilbert's tenth problem — is the tenth on the list of Hilbert s problems of 1900. Its statement is as follows:Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: To devise a process according to which it… … Wikipedia
Rank of a group — For the dimension of the Cartan subgroup, see Rank of a Lie group In the mathematical subject of group theory, the rank of a group G , denoted rank( G ), can refer to the smallest cardinality of a generating set for G , that is:… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia